Presburger arithmetic - PDFSEARCH.IO - Document Search Engine

Presburger arithmetic
Results: 26

#	Item
11	Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic Viktor Kuncak1 and Martin Rinard2 1 Ecole Politechnique F´ed´erale de Lausanne, Lausanne, VD, Switzerland Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2007-12-05 11:59:40 Logic in computer science Model theory Complexity classes Boolean algebra Electronic design automation Boolean satisfiability problem Presburger arithmetic Quantifier elimination Decision problem Theoretical computer science Computational complexity theory Applied mathematics
12	A Verification Toolkit for Numerical Transition Systems Tool Paper⋆ Hossein Hojjat1 , Filip Koneˇcn´y2,4, Florent Garnier2 , Radu Iosif2 , Viktor Kuncak1, and Philipp R¨ummer3 1 Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2012-06-11 13:15:35 Logic in computer science Model theory Presburger arithmetic Proof theory Data types Computability theory Oz Abstract interpretation Peano axioms Mathematical logic Mathematics Theoretical computer science
13	Comfusy: A Tool for Complete Functional Synthesis Tool Presentation Viktor Kuncak, Mika¨el Mayer, Ruzica Piskac, Philippe Suter? Swiss Federal Institute of Technology (EPFL), Switzerland Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-05-11 07:07:53 Logic in computer science Formal methods Constraint programming Electronic design automation NP-complete problems Satisfiability Modulo Theories Algorithm Presburger arithmetic Function Mathematics Theoretical computer science Mathematical logic
14	MUNCH - Automated Reasoner for Sets and Multisets Ruzica Piskac and Viktor Kuncak Swiss Federal Institute of Technology Lausanne (EPFL) Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-05-11 07:07:53 Logic in computer science Metalogic Model theory Multiset NP-complete problems Presburger arithmetic Satisfiability Modulo Theories Cardinality Generalized arithmetic progression Mathematics Mathematical logic Theoretical computer science
15	Presburger Arithmetic and Pseudo-Recursive Saturation David Llewellyn-Jones School of Mathematics and Statistics The University of Birmingham Edgbaston, Birmingham, B15 2TT, U.K. Add to Reading List Source URL: www.flypig.co.uk Language: English - Date: 2015-04-13 15:49:07 Logic in computer science Proof theory Mathematics Quantifier elimination Presburger arithmetic Mathematical logic Model theory Logic
16	Anatomy of Alternating Quantifier Satisfiability (Work in progress) Anh-Dung Phan Technical University of Denmark Nikolaj Bjørner Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-06-03 10:03:44 Model theory Logic in computer science Predicate logic Computability theory Metalogic Quantifier elimination Satisfiability Modulo Theories Presburger arithmetic True quantified Boolean formula Theoretical computer science Logic Mathematical logic
17	On the Satisfiability of Two-Variable Logic over Data Words Claire David, Leonid Libkin, and Tony Tan School of Informatics, University of Edinburgh Abstract. Data trees and data words have been studied extensively Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2010-12-15 16:01:47 Theoretical computer science Model theory Automata theory Regular language Presburger arithmetic Structure Decision problem Mathematics Mathematical logic Formal languages
18	The Ackermann Award 2007 M. Grohe, M. Hyland, J.A. Makowsky, and D. Niwinski Members of EACSL Jury for the Ackermann Award? The third Ackermann Award is presented at this CSL’07. This is the first year in which the EAC Add to Reading List Source URL: eacsl.kahle.ch Language: English - Date: 2013-12-08 17:58:05 Mathematics Decidability Presburger arithmetic Automated theorem proving Natural deduction Wilhelm Ackermann Quantifier elimination Modal logic Deep inference Proof theory Logic Mathematical logic
19	@TechReport{Stansifer:1884:PAIA, author="Ryan Stansifer", title= "Presburger’s Article on Integer Airthmetic: Remarks and Translation", number="TR84-639", institution="Cornell University, Computer Science Department", Add to Reading List Source URL: cs.fit.edu Language: English - Date: 2007-01-22 14:30:32 Model theory Proof theory Metalogic Logic in computer science Computability theory Presburger arithmetic Quantifier elimination Decidability Jan Łukasiewicz Mathematical logic Logic Mathematics
20	Taming Past LTL and Flat Counter Systems Stéphane Demria , Amit Kumar Dharb , Arnaud Sangnierb a b Add to Reading List Source URL: www.lsv.ens-cachan.fr Language: English - Date: 2015-03-26 04:34:20 Metalogic Proof theory Temporal logic Logic in computer science Linear temporal logic Presburger arithmetic PAT Model checking Satisfiability Mathematical logic Logic Model theory